Digite uma palavra ou frase em qualquer idioma 👆
Idioma:
Tradução e análise de palavras por inteligência artificial ChatGPT
Nesta página você pode obter uma análise detalhada de uma palavra ou frase, produzida usando a melhor tecnologia de inteligência artificial até o momento:
- como a palavra é usada
- frequência de uso
- é usado com mais frequência na fala oral ou escrita
- opções de tradução de palavras
- exemplos de uso (várias frases com tradução)
- etimologia
O que (quem) é graph reduction - definição
EFFICIENT VERSION OF NON-STRICT EVALUATION
Combinator graph reduction
graph reduction
A technique invented by Chris Wadsworth where an expression is
represented as a directed graph (usually drawn as an
inverted tree). Each node represents a function call and its
subtrees represent the arguments to that function. Subtrees
are replaced by the expansion or value of the expression they
represent. This is repeated until the tree has been reduced
to a value with no more function calls (a normal form).
In contrast to string reduction, graph reduction has the
advantage that common subexpressions are represented as
pointers to a single instance of the expression which is only
reduced once. It is the most commonly used technique for
implementing lazy evaluation.
Graph reduction
In computer science, graph reduction implements an efficient version of non-strict evaluation, an evaluation strategy where the arguments to a function are not immediately evaluated. This form of non-strict evaluation is also known as lazy evaluation and used in functional programming languages.
Dimensionality reduction
PROCESS OF REDUCING THE NUMBER OF RANDOM VARIABLES UNDER CONSIDERATION
Dimension reduction; Dimensionality Reduction; Dimensionality reduction algorithm; Linear dimensionality reduction
Dimensionality reduction, or dimension reduction, is the transformation of data from a high-dimensional space into a low-dimensional space so that the low-dimensional representation retains some meaningful properties of the original data, ideally close to its intrinsic dimension. Working in high-dimensional spaces can be undesirable for many reasons; raw data are often sparse as a consequence of the curse of dimensionality, and analyzing the data is usually computationally intractable (hard to control or deal with).
Wikipédia
Graph reduction
In computer science, graph reduction implements an efficient version of non-strict evaluation, an evaluation strategy where the arguments to a function are not immediately evaluated. This form of non-strict evaluation is also known as lazy evaluation and used in functional programming languages. The technique was first developed by Chris Wadsworth in 1971.
